Bio-inspired Ant Algorithms: A review
نویسندگان
چکیده
─ Ant Algorithms are techniques for optimizing which were coined in the early 1990‟s by M. Dorigo. The techniques were inspired by the foraging behavior of real ants in the nature. The focus of ant algorithms is to find approximate optimized problem solutions using artificial ants and their indirect decentralized communications using synthetic pheromones. In this paper, at first ant algorithms are described in details, then transforms to computational optimization techniques: the ACO metaheuristics and developed ACO algorithms. A comparative study of ant algorithms also carried out, followed by past and present trends in AAs applications. Future prospect in AAs also covered in this paper. Finally a comparison between AAs with well-established machine learning techniques were focused, so that combining with machine learning techniques hybrid, robust, novel algorithms could be produces for outstanding result in future. Index Terms─ Stigmergic, Forage, Pheromone, Combitorial Optimisation, GA, Artificial Ant, AI.
منابع مشابه
A Review of Bio-inspired Algorithms for Vehicle Routing
This chapter reviews biologically inspired algorithms for solving a class of difficult combinatorial optimization problems known as vehicle routing problems, where least cost collection or delivery routes are designed to serve a set of customers in a transportation network. From a methodological standpoint, the review includes evolutionary algorithms, ant colony optimization, particle swarm opt...
متن کاملA Review on Security Issues in Wireless Sensor Networks using Bio-inspired Computing
Wireless Sensor Networks (WSNs) is one of the most upcoming research area in computer science. Many issues such as clustering, routing and security problems were addressed by the latest interdisciplinary science. Now a days the BioInspired Computing algorithms becomes more popular to solve the various issues of computer science field. BioInspired Computing algorithms are the excellent behavior ...
متن کاملBio-inspired Algorithms for TSP and Generalized TSP
The Traveling Salesman Problem (TSP) is to find a Hamiltonian tour of minimal length on a fully connected graph. The TSP is a NP-Complete, and there is no polynomial algorithm to find the optimal result. Many bio-inspired algorithms has been proposed to address this problem. Generally, generic algorithm (GA), ant colony optimization (ACO) and particle swarm optimization (PSO) are three typical ...
متن کاملBio inspired computing - A review of algorithms and scope of applications
With the explosion of data generation, getting optimal solutions to data driven problems is increasingly becoming a challenge, if not impossible. It is increasingly being recognised that applications of intelligent bio-inspired algorithms are necessary for addressing highly complex problems to provide working solutions in time, especially with dynamic problem definitions, fluctuations in constr...
متن کاملReview of Bio-inspired Algorithm in Wireless Sensor Network: ACO, ACO using RSSI and Ant Clustering
Biological inspired routing or bio-inspired routing is a new heuristic routing algorithm in wireless sensor network, which is inspired from biological activities of insects. ACO is ants’ inspired routing algorithm ACO, which has the ability to find shortest path and re-establish the new route in the case of route failure. In order to improve the network performance i.e. increase network lifetim...
متن کاملBio-inspired cost-aware optimization for data-intensive service provision
The rapid proliferation of enormous sources of digital data and the development of cloud computing have led to greater dependence on data-intensive services. Each service may actually request or create a large amount of data sets. The scope, number, and complexity of data-intensive services are all set to soar in the future. To compose these services will be more challenging. Issues of autonomy...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013